“Hook-Swinging” in India

Swinging Types At Work

We present a number of swinging specifications with visible and/or hidden components, such as lists, sets, bags, maps, monads, streams, trees, graphs, processes, nets, classes, languages, parsers,... They provide more or less worked-out case studies and shall allow the reader to figure out the integrative power of the swinging type approach with respect to various specification and proof formal...

Structured Swinging Types

Swinging types (STs) provide an axiomatic specification formalism for designing and verifying software in terms of many-sorted logic and canonical models. STs are one-tiered insofar as static and dynamic, structural and behavioral aspects of a system are treated on the same syntactic and semantic level. Canonical models interpret relations as least or greatest fixpoints. All reasoning about a p...

Modular Swinging Types

Swinging types 18] provide an integrated framework for specifying software on the basis of many-sorted logic in terms of \static" functions and relations as well as \dynamic" transition systems. Swinging types combine equational, Horn and modal logic for the purpose of using evaluation and proof rules from all three logics for rapid prototyp-ing and veriication. A swinging speciication separate...

The Swinging Chair Test

Chaos in the Swinging Atwood Machine (SAM)

A normal Atwood Machine is composed of two masses connected with a string, hanging from pulleys, (see figure 1). This system is often used to teach Newton’s laws of motion due to its simplicity. However, it is not very interesting to study beyond that. When the two masses are not equal, the heavier one will accelerate down and the other will accelerate up at the same rate. When the masses are e...